A New Active Convex Hull Model For Image Database's Search Space Partitioning
نویسنده
چکیده
This paper presents a new active convex hull model to be used for search space partitioning to decrease the time needed for image retrieval from large image database. The model is based on the geometric heat differential equation and has the following advantages: capable of automatic image segmentation to shells; large capture range; invariant with respect to scaling, rotations and translations; can handle regions without edges. Using the model a tool is developed capable of detecting the convex hull (CH) of each region within the image database and the query image. Employing the illumination theorem the set of database CHs is partitioned to 344 sub-bases. Thus, for each query region a search is performed in this sub-base, whose CH most closely matches the CH of the query region. It provides a factor of hundred reductions in the number of image database regions necessary to be traversed and compared with the query regions. The latter is an important advantage, because matching query shapes against every region conflicts with the goal of high retrieval speed.
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملFeasibility of detecting and localizing radioactive source using image processing and computational geometry algorithms
We consider the problem of finding the localization of radioactive source by using data from a digital camera. In other words, the camera could help us to detect the direction of radioactive rays radiation. Therefore, the outcome could be used to command a robot to move toward the true direction to achieve the source. The process of camera data is performed by using image processing and computa...
متن کاملA Fast Convex Hull Algorithm for Binary Image
Convex hull is widely used in computer graphic, image processing, CAD/CAM and pattern recognition. In this work, we derive some new convex hull properties and then propose a fast algorithm based on these new properties to extract convex hull of the object in binary image. It is achieved by computing the extreme points, dividing the binary image into several regions, scanning the regions existin...
متن کاملColor Gamut Characterization Via Ray Tracing for Device Profile Generation
Color gamut characterization is an essential step in the ICC profile generation for imaging devices. It is also needed as part of evaluation and comparison of image quality achievable by different imaging systems. A novel technique is presented for characterizing the color gamut of an imaging device via ray tracing in the CIELAB color space. Initially, the convex hull of the set of measurement ...
متن کاملDetermining the Convex Hull in Large Multidimensional Databases
Determining the convex hull of a point set is a basic operation for many applications of pattern recognition, image processing, statistics, and data mining. Although the corresponding point sets are often large, the convex hull operation has not been considered much in a database context, and state-of-the-art algorithms do not scale well to non main-memory resident data sets. In this paper, we ...
متن کامل